Structure Preserving Algorithms for Perplectic Eigenproblems∗
نویسندگان
چکیده
Structured real canonical forms for matrices in Rn×n that are symmetric or skew-symmetric about the anti-diagonal as well as the main diagonal are presented, and Jacobi algorithms for solving the complete eigenproblem for three of these four classes of matrices are developed. Based on the direct solution of 4× 4 subproblems constructed via quaternions, the algorithms calculate structured orthogonal bases for the invariant subspaces of the associated matrix. In addition to preserving structure, these methods are inherently parallelizable, numerically stable, and show asymptotic quadratic convergence.
منابع مشابه
Ela Structure Preserving Algorithms for Perplectic
Structured real canonical forms for matrices in Rn×n that are symmetric or skewsymmetric about the anti-diagonal as well as the main diagonal are presented, and Jacobi algorithms for solving the complete eigenproblem for three of these four classes of matrices are developed. Based on the direct solution of 4 × 4 subproblems constructed via quaternions, the algorithms calculate structured orthog...
متن کاملStructured Polynomial Eigenproblems Related to Time-delay Systems
A new class of structured polynomial eigenproblems arising in the stability analysis of time-delay systems is identified and analyzed together with new types of closely related structured polynomials. Relationships between these polynomials are established via the Cayley transformation. Their spectral symmetries are revealed, and structure-preserving linearizations constructed. A structured Sch...
متن کاملOn backward errors of structured polynomial eigenproblems solved by structure preserving linearizations
First, we derive explicit computable expressions of structured backward errors of approximate eigenelements of structured matrix polynomials including symmetric, skew-symmetric, Hermitian, skew-Hermitian, even and odd polynomials. We also determine minimal structured perturbations for which approximate eigenelements are exact eigenelements of the perturbed polynomials. Next, we analyze the effe...
متن کاملNumerical Computation of Cubic Eigenvalue Problems for a Semiconductor Quantum Dot Model with Non-parabolic Effective Mass Approximation
We consider the three-dimensional Schrödinger equation simulating nanoscale semiconductor quantum dots with non-parabolic effective mass approximation. To discretize the equation, we use non-uniform meshes with half-shifted grid points in the radial direction. The discretization yields a very large eigenproblem that only several eigenpairs embedded in the spectrum are interested. The eigenvalue...
متن کاملQuadratic Eigenproblems Are No Problem
High-dimensional eigenproblems often arise in the solution of scientiic problems involving stability or wave modeling. In this article we present results for a quadratic eigenproblem that we encountered in solving an acoustics problem, speciically in modeling the propagation of waves in a room in which one wall was constructed of sound-absorbing material. EEcient algorithms are known for the st...
متن کامل